Efficient at-most-once messages based on synchronized clocks
نویسندگان
چکیده
منابع مشابه
Arcs Intersecting at Most Once
We prove that on a punctured oriented surface with Euler characteristic χ < 0, the maximal cardinality of a set of essential simple arcs that are pairwise nonhomotopic and intersecting at most once is 2|χ|(|χ|+1). This gives a cubic estimate in |χ| for a set of curves pairwise intersecting at most once on a closed surface. We also give polynomial estimates in |χ| for sets of arcs and curves pai...
متن کاملThe Strong At-Most-Once Problem
The at-most-once problem in shared memory asks for the completion of a number of tasks by a set of independent processors while adhering to “at most once” semantics. At-most-once algorithms are evaluated in terms of effectiveness, which is a measure that expresses the total number of tasks completed at-most-once in the worst case. Motivated by the lack of deterministic solutions with high effec...
متن کاملSecure Timeliness: On the Cost of Non-Synchronized Clocks
The establishment of event timeliness in a distributed system by reliance on an assumption of closely synchronized clocks may introduce security flaws. We present a method for determining the message cost associated with the relaxation of such an assumption in protocols. The method is used to examine multi-domain authentication protocols and to establish that for these protocols the additional ...
متن کاملAt-most-once Algorithm for Linearizable RPC in Distributed Systems
In a distributed system, like RAMCloud, supporting automatic retry of RPC, it is tricky to achieve linearizability correct along with durability and liveness. Automatic retry may cause duplicate executions when a server fails after durably recording the original execution and before sending its response. We can cope with the problem by implementing at-most-once mechanism for RPC system. But in ...
متن کاملStructural Clocks for a Loosely Synchronized Data-Parallel Language
Nowadays, most of distributed architectures are MIMD (Multiple Instruction streams, Multiple Data streams) parallel computers or networks of workstations. They are easily scalable, concerning the number of processing elements, the amount of memory or the bandwidth of the underlying communication network. The challenge consists in taking advantage of the power of these architectures. It has been...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGCOMM Computer Communication Review
سال: 1990
ISSN: 0146-4833
DOI: 10.1145/99517.99530